Incentive-Compatible Interdomain Routing with Linear Utilities
نویسندگان
چکیده
We revisit the problem of incentive-compatible interdomain routing, examining the quite realistic special case in which the utilities of autonomous systems (ASes) are linear functions of the traffic in the incident links and the traffic leaving each AS. We show that incentive-compatibility toward maximizing total welfare is achievable efficiently, and in the uncapacitated case, by an algorithm that can be easily implemented by the border gateway protocol (BGP), the standard protocol for interdomain routing.
منابع مشابه
Towards a Realistic Model of Incentives in Interdomain Routing: Decoupling Forwarding from Signaling
We model the task of interdomain routing—the task of connecting the networks that compose the Internet—as an iterative, highly distributed, asynchronous game. Unlike previous examinations of this game that assumed quasi-linear utilities, we assume that each node has a quasi-bilinear utility depending not only on the route it believes it is assigned in the outcome, but also on other nodes assign...
متن کاملOn the equivalence of Bayesian and dominant strategy implementation in a general class of social choice problems
We consider a standard social choice environment with linear utilities and independent, one-dimensional, private values. We provide a short and constructive proof that for any Bayesian incentive compatible mechanism there exists an equivalent dominant strategy incentive compatible mechanism that delivers the same interim expected utilities for all agents. We demonstrate the usefulness and appli...
متن کاملInterdomain Routing with Negotiation
Current interdomain routing policies are largely based on information local to each ISP, in part due to competitive concerns and the lack of effective information sharing mechanisms. This can lead to routes that are sub-optimal and even to routes that oscillate. We explore a setting in which two neighboring ISPs negotiate to determine the path of the traffic they exchange. We first ask the basi...
متن کاملSome Foundational Problems in Interdomain Routing
The substantial complexity of interdomain routing in the Internet comes from the need to support flexible policies while scaling to a large number of Autonomous Systems. Despite impressive progress in characterizing the various ills of the Border Gateway Protocol (BGP), many problems remain unsolved, and the behavior of the routing system is still poorly understood. This paper argues that we mu...
متن کاملRoute Bazaar: Automatic Interdomain Contract Negotiation
While it is widely acknowledged that the Border Gateway Protocol (BGP) has many flaws, most of the proposed fixes focus solely on improving the stability and security of its path computation. However, because interdomain routing involves contracts between Autonomous Systems (ASes), this paper argues that contractual and routing issues should be tackled jointly. We propose Route Bazaar, a backwa...
متن کامل